Efficient Countermeasure for Securing the Eta Pairing Computation over Binary Fields

نویسنده

  • Mustapha Hedabou
چکیده

Pairing based cryptosystems have became suitable for use on constrained devices with small resources. Recently, It has shown that side channel attacks are a serious threat for such cryptographic applications. In order to secure the pairing based cryptosystems against the side channel attacks, many countermeasures have been proposed but their cost is proved to be highly expensive. In this paper, we propose a new technique for securing the eta pairing ηT over binary fields K = F2m . The main idea of the proposed countermeasure is the use of the randomized values x+ fi(r), where x is a variable involved in the computation of eta pairing, fi is a polynomial function, and r is a random integer in F2m . The overhead cost of the proposed countermeasure is only (m + 1)/2 field multiplications which makes it the most efficient known countermeasure for securing eta pairing against the side channel attacks over binary fields.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields

Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is crucial to provide efficient and secure implementations of the pairings. There have been several works on efficient implementations of the pairings. However, the research for secure implementations of the pairings ha...

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates

In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for ...

متن کامل

Eta Pairing Computation on General Divisors over Hyperelliptic Curves y2 = x7-x+/-1

Recent developments on the Tate or Eta pairing computation over hyperelliptic curves by Duursma–Lee and Barreto et al. have focused on degenerate divisors. We present efficient methods that work for general divisors to compute the Eta paring over divisor class groups of the hyperelliptic curves Hd : y2 = x p−x+d where p is an odd prime. On the curve Hd of genus 3, we provide two efficient metho...

متن کامل

Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields

After Miller’s original algorithm for the Tate pairing computation, many improved algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al., especially for the fields with characteristic three. Also Duursma and Lee found a closed formula of the Tate pairing computation for the fields with characteristic three. In this paper, we show that a similar argument is al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Network Security

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2012